Wikipedia graph mining: dynamic structure of collective memory
نویسندگان
چکیده
ABSTRACT Wikipedia is the biggest ever created encyclopedia and the fifth most visited website in the world. Tens of millions of people surf it every day, seeking answers to various questions. Collective user activity on the pages leaves publicly available footprints of human behavior, making Wikipedia a great source of the data for largescale analysis of collective dynamical patterns. The dynamic nature of the Wikipedia graph is the main challenge for the analysis. In this work, we propose a graph-based dynamical pattern extraction model, inspired by the Hebbian learning theory. We focus on data-streams with underlying graph structure and perform several large-scale experiments on the Wikipedia visitor activity data. We extract dynamical patterns of collective activity and show that they correspond to meaningful clusters of associated events, reflected in the Wikipedia articles. We demonstrate evolutionary dynamics of the graphs over time to highlight changing nature of visitors’ interests. Apart from that, we discuss clusters of events that model collective recall process and represent collective memories – common memories shared by a group of people. In the experiments, we show that the presented model is scalable in terms of time-series length and graph density, providing a distributed implementation of the proposed algorithm.
منابع مشابه
Adapting Graph Application Performance Via Alternate Data Structure Representations
Graph processing is used extensively in areas from social networking mining to web indexing. We demonstrate that the performance and dependability of such applications critically hinges on the graph data structure used, because a fixed, compile-time choice of data structure can lead to poor performance or applications unable to complete. To address this problem, we introduce an approach that he...
متن کاملAdapting Graph Application Performance via Alternate Data Structure Representation
Graph processing is used extensively in areas from social networking mining to web indexing. We demonstrate that the performance and dependability of such applications critically hinges on the graph data structure used, because a fixed, compile-time choice of data structure can lead to poor performance or applications unable to complete. To address this problem, we introduce an approach that he...
متن کاملThe Effect of Dynamic Assessment of Toulmin Model through Teacher- and Collective-Scaffolding on Argument Structure and Argumentative Writing Achievement of Iranian EFL Learners
Considering the paramount importance of writing logical arguments for college students, this study investigated the effect of dynamic assessment (DA) of Toulmin model through teacher- and collective-scaffolding on argument structure and overall quality of argumentative essays of Iranian EFL university learners. In so doing, 45 male and female Iranian EFL learners taking part in the study were r...
متن کاملExamining Collective Memory Building in Wikipedia: A Multilevel Network Approach
This study interprets Wikipedia as a memory place where independent contributors discuss and negotiate the meanings of past events in a collaborative way. We examine how interconnections between high-impact events lead to the differential patterns of collective memory building. The results show that the presence of a direct network tie between two events is related to a smaller difference in th...
متن کاملDiscovering Periodic Patterns using Supergraph in Dynamic Networks
In dynamic networks, interactions that occur periodically express especially significant meaning. However, these patterns occur infrequently, so it is difficult to detect among mass data. To identify such periodic patterns in dynamic networks, we propose single pass supergraph based periodic pattern mining SPBMiner technique that is polynomial unlike most graph mining problems. The proposed tec...
متن کامل